Structure Fault Tolerance of Bubble-Sort Star Graphs
نویسندگان
چکیده
As two significant performance indicators, structure connectivity and substructure have been widely studied, they are used to judge a network’s fault tolerance properties from the perspective of becoming faulty. An n-dimensional bubble-sort star graph BSn is popular interconnection network with many good properties. We find upper bounds κ(BSn;K1,3) κs(BSn;K1,3) in this paper. Furthermore, we establish κ(BSn;H) κs(BSn;H) BSn, where H∈{K1,K1,1,K1,2}.
منابع مشابه
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs
An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. Connectivity is an important measurement for the fault tolerant in interconnection network. Two vertices is maximally local-connected if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vert...
متن کاملFault Tolerance on Star Graphs
A multiprocessor system consists of a set of processing units and each of them has its own local memory. The processing units in a multiprocessor system are linked in some topology. What we are interested in is a topology proposed by Akers et al. [2,3], called star graph. An n-dimensional star graph can be represented by S,, = (V,,, E,,), where V,, consists of n! nodes in which each node is ide...
متن کاملEmbedding Algorithms for Bubble-Sort, Macro-star, and Transposition Graphs
Bubble-sort, macro-star, and transposition graphs are interconnection networks with the advantages of star graphs in terms of improving the network cost of a hypercube. These graphs contain a star graph as their sub-graph, and have node symmetry, maximum fault tolerance, and recursive partition properties. This study proposes embedding methods for these graphs based on graph definitions, and sh...
متن کاملAdjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs
Let Sn be an n-dimensional Star graph. In this paper, we show that Sn − F is Hamiltonian laceable where F is the set of f ≤ (n − 4) pairs of adjacent faulty vertices, Sn − F is Hamiltonian where F is the set of f ≤ (n − 3) pairs of adjacent faulty vertices. We also show that Sn − F is hyper-Hamiltonian laceable where F is the set of f ≤ (n − 4) pairs of adjacent faulty vertices. Applying these ...
متن کاملGeneralized Measures of Edge Fault Tolerance in -star Graphs
This paper considers a kind of generalized measure of fault tolerance in the -star graph for and , and determines , which implies that at least edges of have to remove to get a disconnected graph that contains no vertices of degree less than . This result shows that the -star graph is robust when it is used to model the topological structure of a large-scale parallel processing system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2023
ISSN: ['2078-2489']
DOI: https://doi.org/10.3390/info14020120